Sharper WCET Upper Bounds using Automatically Detected Scenarios
نویسندگان
چکیده
Modern embedded applications usually have real-time constraints and they are implemented using heterogeneous multiprocessor systems-on-chip. Dimensioning a system requires accurate estimations of the worst-case execution time (WCET). Overestimation leads to over-dimensioning. This paper introduces a method for automatic discovery of scenarios that incorporate correlation between different parts of applications. It is based on the application parameters with a large impact on the execution time. We show on a benchmark that using scenarios the estimated WCET may be reduced with 16%.
منابع مشابه
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expressions that may contain parameters. These parameters may represent, for instance, values of input parameters to the program, or maximal iteration counts for loops. We describe a technique for fully automatic parametri...
متن کاملAlgorithms for Infeasible Path Calculation
Static Worst-Case Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component in static WCET analysis is to derive flow information, such as loop bounds and infeasible paths. Such flow information can be provided as either as annotations by the user, can be autom...
متن کاملLoop Bound Analysis based on a Combination of Program Slicing, Abstract Interpretation, and Invariant Analysis
Static Worst-Case Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component for static derivation of precise WCET estimates is upper bounds on the number of times different loops can be iterated. In this paper we present an approach for deriving upper loop boun...
متن کاملPractical Experiments with Symbolic Loop Bound Computation for WCET Analysis1
We present an automatic method for computing tight upper bounds on the iteration number of special classes of program loops. These upper bounds are further used in the WCET analysis of programs. Program flow is refined using SMT reasoning, rewriting multi-path loops into single-path ones. Single-path loops are further translated into a set of recurrence relations over program variables. To solv...
متن کاملMerging Techniques for Faster Derivation of WCET Flow Information using Abstract Execution
Static Worst-Case Execution Time (WCET) analysis derives upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component in static WCET analysis is to derive flow information, such as loop bounds and infeasible paths. We have previously introduced abstract execution (AE), a method capable of deriving very precise flow inf...
متن کامل